Spatial-temporal Collaborative Sequential Monte Carlo for Mobile Robot Localization in Distributed Intelligent Environments

نویسندگان

  • Kun Qian
  • Xudong Ma
  • Xian Zhong Dai
  • Fang Fang
چکیده

In this paper, a spatial-temporal collaborative sequential Monte Carlo architecture for mobile robot localization is designed to well suites intelligent environment for service robotic system. A proposed algorithm, namely Distributed Proportional Allocation-Augmented Particle Filter (DPA-APF), resolves the sensor collaboration problem by the processes of augmented sampling, inter-node resampling, inner-node resampling and particle exchange. These procedures exploit data parallelism and pipelining of resampling operations and improve the scalability of distributed particle filters (PFs). Moreover, modified visual and laser sensor perception models are also addressed to guarantee reliable and accurate robot localization in dynamic scenarios that robot coexists with people. The proposed method is applied to a home-care robotic intelligent room with distributed smart nodes, and the experimental results validate the effectiveness of the proposed INTERNATIONAL JOURNAL ON SMART SENSING AND INTELLIGENT SYSTEMS VOL. 5, NO. 2, JUNE 2012

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collaborative Multi-Robot Monte Carlo Localization in Assistant Robots

This paper presents an algorithm for collaborative mobile robot localization based on probabilistic methods (Monte Carlo localization) used in assistant robots. When a root detects another in the same environment, a probabilistic method is used to synchronize each robot’s belief. As a result, the robots localize themselves faster and maintain higher accuracy. The technique has been implemented ...

متن کامل

Multirobot Localization in Highly Symmetrical Environments

The paper addresses and solves the problem of multirobot collaborative localization in highly symmetrical 2D environments, such as the ones encountered in logistic applications. Because of the environment symmetry, the most common localization algorithms may fail to provide a correct estimate of the position and orientation of the robot, if its initial position is not known, no specific landmar...

متن کامل

Monte Carlo Filter in Mobile Robotics Localization: A Clustered Evolutionary Point of View

Localization, i.e., estimating a robot pose relative to a map of an environment, is one of the most relevant problems in mobile robotics. The research community has devoted a big effort to provide solutions for the localization problem. Several methodologies have been proposed, among them the Kalman filter and Monte Carlo Localization filters. In this paper, the Clustered Evolutionary Monte Car...

متن کامل

An Analysis of Parallel Approaches for a Mobile Robotic Self-localization Algorithm

Self-localization is a fundamental problem in mobile robotics. It consists of estimating the position of a robot given a map of the environment and information obtained by sensors. Among the algorithms used to address this issue, the Monte Carlo technique has obtained a considerable attention by the scientific community due to its simplicity and efficiency. Monte Carlo localization is a sample-...

متن کامل

A Probabilistic On-Line Mapping Algorithm for Teams of Mobile Robots

An efficient probabilistic algorithm for the concurrent mapping and localization problem that arises in mobile robotics is presented. The algorithm addresses the problem in which a team of robots builds a map on-line while simultaneously accommodating errors in the robots’ odometry. At the core of the algorithm is a technique that combines fast maximum likelihood map growing with a Monte Carlo ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012